Age and weak indivisibility
نویسنده
چکیده
Let H be a countable infinite homogeneous relational structure. If H is indivisible then it is weakly indivisible and if it is weakly indivisible then it is age indivisible. There are examples of countable infinite homogeneous structures which are weakly indivisible but not indivisible. It is a natural question to ask for examples of countable age indivisible homogenous structures which are not weakly indivisible. I am not aware of any such. Could it possibly be true that age indivisibility for countable homogeneous relational structures implies weak indivisibility?
منابع مشابه
Some weak indivisibility results in ultrahomogeneous metric spaces
We study the validity of a partition property known as weak indi-visibility for the integer and the rational Urysohn metric spaces. We also compare weak indivisiblity to another partition property, called age-indivisibility, and provide an example of a countable ultrahomogeneous metric space which is age-indivisible but not weakly indivisible.
متن کاملIndivisibility and Divisibility Polytopes
We study the the polytopes of binary n-strings that encode (positive) integers that are not divisible by a particular positive integer p | the indivisibility polytopes, as well as the more general \clipped cubes". Also, we discuss a potential application to factoring. Finally, we present some results concerning divisibility polytopes.
متن کاملOn symmetric indivisibility of countable structures
A structure M ≤ N is symmetrically embedded in N if any σ ∈ Aut(M) extends to an automorphism of N . A countable structure M is symmetrically indivisible if for any coloring of M by two colors there exists a monochromatic M ≤ M such that M ∼= M and M is symmetrically embedded in M. We give a model-theoretic proof of the symmetric indivisibility of Rado’s countable random graph [9] and use these...
متن کاملCore Discussion Paper 2000/xx Indivisibility and Divisibility Polytopes
We study the the polytopes of binary n-strings that encode (positive) integers that are not divisible by a particular positive integer p | the indivisibility polytopes, as well as the more general \clipped cubes". Also, we discuss a potential application to factoring. Finally, we present some results concerning divisibility polytopes.
متن کاملLecture Notes: Comparison-Based Lower Bounds
We have proved in a previous lecture that the permutation problem on n elements requires Ω(min{n, n B logM/B n B}) I/Os to solve in the indivisibility model. This immediately implies the same lower bound for sorting—if we can sort n elements in x I/Os, then we can also permute them in O(x) I/Os. This, in turn, means that no “indivisible” EM algorithm can always sort in o( n B logM/B n B ) I/Os,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 37 شماره
صفحات -
تاریخ انتشار 2014